منابع مشابه
Methodology for Constructing Problem Definitions in Bioinformatics
MOTIVATION A recurrent criticism is that certain bioinformatics tools do not account for crucial biology and therefore fail answering the targeted biological question. We posit that the single most important reason for such shortcomings is an inaccurate formulation of the computational problem. RESULTS Our paper describes how to define a bioinformatics problem so that it captures both the und...
متن کاملA Methodology for Constructing Collective Causal Maps
This paper develops a new approach for constructing causal maps called the Collective Causal Mapping Methodology (CCMM). This methodology collects information asynchronously from a group of dispersed and diverse subject-matter experts via web technologies. Through three rounds of data collection, analysis, mapping, and interpretation, CCMM constructs a parsimonious collective causal map. The pa...
متن کاملA methodology for constructing fuzzy algorithms for learning vector quantization
This paper presents a general methodology for the development of fuzzy algorithms for learning vector quantization (FALVQ). The design of specific FALVQ algorithms according to existing approaches reduces to the selection of the membership function assigned to the weight vectors of an LVQ competitive neural network, which represent the prototypes. The development of a broad variety of FALVQ alg...
متن کاملConstructing a web information system development methodology
This paper reports on the extension of the Multiview framework to webbased information systems. The aims are firstly to investigate the appropriateness of Multiview – a pre-Internet analysis and design methodology – to web-based information systems and, secondly, to reflect on the nature and role of methodology, as distinct from method, in the information systems (IS) development process. A 2-y...
متن کاملA Methodology for Constructing Predicate Transition Net Specifications
ion rule for P-subnets Let N = ( P, T; F,L,R ) be a PrT net, and N s = ( P s, T s; F s, L s, R s) be a P-subnet of N with all predicates in bd( N s) having the same arity to ensure a well-defined interpretation of the new resulting predicate. 1. Destructive abstraction (the subnet is discarded). The result of replacing N s by a new predicate p with { p } ∩ ( P ∪ T ) = ∅ is a new PrT net N ′ = (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Clinical Pathology
سال: 2005
ISSN: 0021-9746
DOI: 10.1136/jcp.2004.018374